31 research outputs found

    Invariant measures for Cartesian powers of Chacon infinite transformation

    Full text link
    We describe all boundedly finite measures which are invariant by Cartesian powers of an infinite measure preserving version of Chacon transformation. All such ergodic measures are products of so-called diagonal measures, which are measures generalizing in some way the measures supported on a graph. Unlike what happens in the finite-measure case, this class of diagonal measures is not reduced to measures supported on a graph arising from powers of the transformation: it also contains some weird invariant measures, whose marginals are singular with respect to the measure invariant by the transformation. We derive from these results that the infinite Chacon transformation has trivial centralizer, and has no nontrivial factor. At the end of the paper, we prove a result of independent interest, providing sufficient conditions for an infinite measure preserving dynamical system defined on a Cartesian product to decompose into a direct product of two dynamical systems

    Poisson suspensions and entropy for infinite transformations

    Full text link
    The Poisson entropy of an infinite-measure-preserving transformation is defined as the Kolmogorov entropy of its Poisson suspension. In this article, we relate Poisson entropy with other definitions of entropy for infinite transformations: For quasi-finite transformations we prove that Poisson entropy coincides with Krengel's and Parry's entropy. In particular, this implies that for null-recurrent Markov chains, the usual formula for the entropy qipi,jlogpi,j-\sum q_i p_{i,j}\log p_{i,j} holds in any of the definitions for entropy. Poisson entropy dominates Parry's entropy in any conservative transformation. We also prove that relative entropy (in the sense of Danilenko and Rudolph) coincides with the relative Poisson entropy. Thus, for any factor of a conservative transformation, difference of the Krengel's entropy is equal to the difference of the Poisson entropies. In case there exists a factor with zero Poisson entropy, we prove the existence of a maximum (Pinsker) factor with zero Poisson entropy. Together with the preceding results, this answers affirmatively the question raised in arXiv:0705.2148v3 about existence of a Pinsker factor in the sense of Krengel for quasi-finite transformations.Comment: 25 pages, a final section with some more results and questions adde

    La Llei de Benford

    Get PDF
    La llei de Benford reflecteix una irregularitat inesperada en la distribució dels dígits de dades aleatòries. En aquest article es descriu el fenomen i se'n discuteixen possibles explicacions.The Benford law reflects an unexpected irregularity in the distribution of digits of random data. In this paper the law is described and some explanations are discussed

    Transposition game

    Full text link
    We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the final sequence in order. We will see that the winner can be the last player, the second last player, the first player, the second player, the person who wants the parity to end up even or the person who wants the parity to end up odd. A special case of the game can be reduced to a game with nontrivial winning strategy, but describable in so simple a way that children can understand it and enjoy playing it

    Almost-sure Growth Rate of Generalized Random Fibonacci sequences

    Get PDF
    We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for n1n\ge 1, Fn+2=λFn+1±FnF_{n+2} = \lambda F_{n+1} \pm F_{n} (linear case) and F~n+2=λF~n+1±F~n\widetilde F_{n+2} = |\lambda \widetilde F_{n+1} \pm \widetilde F_{n}| (non-linear case), where each ±\pm sign is independent and either ++ with probability pp or - with probability 1p1-p (0<p10<p\le 1). Our main result is that, when λ\lambda is of the form λk=2cos(π/k)\lambda_k = 2\cos (\pi/k) for some integer k3k\ge 3, the exponential growth of FnF_n for 0<p10<p\le 1, and of F~n\widetilde F_{n} for 1/k<p11/k < p\le 1, is almost surely positive and given by 0logxdνk,ρ(x), \int_0^\infty \log x d\nu_{k, \rho} (x), where ρ\rho is an explicit function of pp depending on the case we consider, taking values in [0,1][0, 1], and νk,ρ\nu_{k, \rho} is an explicit probability distribution on \RR_+ defined inductively on generalized Stern-Brocot intervals. We also provide an integral formula for 0<p10<p\le 1 in the easier case λ2\lambda\ge 2. Finally, we study the variations of the exponent as a function of pp

    Quel est le début de ce nombre ?

    No full text
    International audienc

    Bounds on Semigroups of Random Rotations on SO(n)

    No full text
    International audienceIn order to generate random orthogonal matrices, Hastings considered a Markov chain on the orthogonal group SO(n) generated by random rotations on randomly selected coordinate planes. We investigate different ways to measure the convergence to equilibrium of this walk. To this end, we prove, up to a multiplicative constant, that the spectral gap of this walk is bounded below by 1/n^2 and the entropy/entropy dissipation bound is bounded above by n^3
    corecore